On the work of Madhu Sudan
نویسنده
چکیده
Madhu Sudan is the recipient of the 2002 Nevanlinna Prize. Sudan has made fundamental contributions to two major areas of research, the connections between them, and their applications. The first area is Coding Theory. Established by Shannon and Hamming over 50 years ago, it is the mathematical study of the possibility of and the limits on reliable communication over noisy media. The second area is Probabilistically Checkable Proofs (PCPs). By contrast, it is only 10 years old. It studies the minimal resources required for probabilistic verification of standard mathematical proofs. My plan is to briefly introduce these areas, their motivation and foundational questions, and then to explain Sudan’s main contributions to each. Before we get to the specific works of Madhu Sudan, let us start with a couple of comments that will set up the context of his work.
منابع مشابه
On the Work of Madhu Sudan, Volume 50, Number 1
Madhu Sudan is the recipient of the 2002 Nevanlinna Prize. Sudan has made fundamental contributions to two major areas of research, the connections between them, and their applications. The first area is coding theory. Established by Shannon and Hamming over fifty years ago, it is the mathematical study of the possibility of, and the limits on, reliable communication over noisy media. The secon...
متن کاملSome closure features of locally testable affine - invariant properties ARCHMEs by Alan
We prove that the class of locally testable affine-invariant properties is closed under sums, intersections and "lifts". The sum and intersection are two natural operations on linear spaces of functions, where the sum of two properties is simply their sum as a vector space. The "lift" is a less well-studied property, which creates some interesting affine-invariant properties over large domains,...
متن کاملProbabilistically Checkable Proofs: A Primer
Probabilistically checkable proofs are proofs that can checked probabilistically by reading very few bits of the proof. Roughly ten years back it was shown that proofs could be made probabilistically checkable with a modest increase in their size. While the initial proofs were a little too complex, a recent proof due to Irit Dinur gives a dramatically simple (and radically new) construction of ...
متن کامل